dual graph中文是什么意思

发音:

中文翻译
造句

对偶图
双图形

dual adj. 二的；二重的；二体的；二元的。 dual pe ...
graph graph3 n. 【语言学】 1.词的拼法 ...
self dual graph 自对偶图
self-dual graph 自对偶图
-graph comb. f. 表示 1.“写、画、记录的用具”： phonograph, telegraph. 2.“写[画、记录]的结果”： autograph, photograph.
a graph 一幅图画
and-or graph “与或”图
graph n. 1.【数学】曲线图；坐标图，图表。 2.统计曲线。 vt. 用图表表示，把…绘入图表。 n. 胶版。 vt. 用胶版印刷。 graph3 n. 【语言学】 1.词的拼法。 2.表示音素的最小字母单位。
dual adj. 二的；二重的；二体的；二元的。 dual personality 双重人格。 n. 【语法】双数；【数学】对偶。 the D- Monarchy 双重君主国〔指第一次世界大战前的奥匈帝国〕。
bipartiter graph bipartite graph 偶图
directed graph undirected graph 有向图无向图
a curve on a graph 图表上的曲线
abstract graph 抽象图
abundance graph 丰度图
activity graph 见活动图
adjoint graph 导出图
aero graph 天线电报机
aerological graph 高空气象图
air graph 〔英国〕缩印航空邮件。
alternating graph 交错图形
analytical graph 分析图表
arc of a graph 图的弧
area graph 面积控制曲线; 面积图
arithmetic graph 算术分度图

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

Dual graph algorithm for the volume of the city road network
城市道路网容量的对偶图算法
Notes on hamiltonian property of dual graphs of plane graphs
平面对偶图哈密顿性的一个充分条件
Notes on hamiltonian property of dual graphs of 3 - regular plane graphs
三正则平面图的对偶图的哈密顿性的注记
The paper gives the necessary and sufficient condition of self - dual graphs , all of self - dual graphs can be structured with this necessary and sufficient codition
摘要给出自对偶图的充要条件，并利用此充要条件，能构造出所有自对偶图。
4 ) an algorithm for reliability upper bound assessment of large - size network is presented , which is based on the principle of topological classification of node - set ; and the lower bound can be also obtained by dual graph of oriented network .
应用图论的点集拓扑分类原理，提出一个计算大型复杂网络可靠度上界的类分法，并应用对偶理论求解网络可靠度的下界。
Moreover , by using the idea of graph theory , this paper constructs the electronic equipment structure graph and its “ dual graph ” , and electromagnetic topological model used to analyze the interaction of the different electrical components is presented
进一步借鉴图论的思想,构造出电子设备结构图及其平面图的“对偶图” ,并由此建立了多层电磁屏蔽条件下分析系统电子器件之间相互耦合的电磁拓扑模型。

百科解释

In the mathematical discipline of graph theory, the dual graph of a plane graph G is a graph that has a vertex corresponding to each face of G, and an edge joining two neighboring faces for each edge in G. The term "dual" is used because this property is symmetric, meaning that if H is a dual of G, then G is a dual of H (if G is connected).

详细百科解释